Nondeterministic soliton automata with a single external vertex
نویسنده
چکیده
Soliton automata are the mathematical models of certain possible molecular switching devices called soliton circuits. Both from theoretical and practical point of view, it is a central question to describe soliton automata with a single external vertex. Extending a result of Dassow and Jürgensen, we characterize nondeterministic automata in this special case.
منابع مشابه
Soliton automata with constant external edges
Soliton automata are the mathematical models of certain possible molecular switching devices. Both from theoretical and practical point of view, it is a central question to describe soliton automata with constant external edges. Extending a result of Dassow and Jürgensen, we characterize soliton automata in this special case.
متن کاملSimulation of Soliton Circuits
Soliton circuits are among the most promising alternatives for molecular electronic devices based on the design of molecular level conventional digital circuits. In order to capture the logical and computational aspects of these circuits, a mathematical model called soliton automaton was introduced by Dassow and Jürgensen in 1990. The underlying object of a soliton automaton is a so called soli...
متن کاملTrace-Based Semantics for Probabilistic Timed I/O Automata
We propose the Probabilistic Timed I/O Automaton (PTIOA) framework for modelling and analyzing discretely communicating probabilistic hybrid systems. State transition of a PTIOA can be nondeterministic or probabilistic. Probabilistic choices can be based on continuous distributions. Continuous evolution of a PTIOA is purely nondeterministic. PTIOAs can communicate through shared actions. By sup...
متن کاملDirectable Fuzzy and Nondeterministic Automata
We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...
متن کاملNFA reduction via hypergraph vertex cover approximation
In this thesis, we study the minimum vertex cover problem on the class of k-partite kuniform hypergraphs. This problem arises when reducing the size of nondeterministic finite automata (NFA) using preorders, as suggested by Champarnaud and Coulon. It has been shown that reducing NFAs using preorders is at least as hard as computing a minimal vertex cover on 3-partite 3-uniform hypergraphs, whic...
متن کامل